Order Acceptance and Scheduling in a Single-Machine Environment: Exact and Heuristic Algorithms
نویسندگان
چکیده
منابع مشابه
Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
This paper studies a generalization of the order acceptance and scheduling problem in a single-machine environment where a pool consisting of firm planned orders as well as potential orders is available from which an over-demanded company can select. The capacity available for processing the accepted orders is limited and each order is characterized by a known processing time, delivery date, re...
متن کاملExact algorithms for inventory constrained scheduling on a single machine
This paper focuses on single machine scheduling subject to inventory constraints. Jobs add or remove items to or from the inventory, respectively. Jobs that remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a single machine where the objective is to minimize the total weighted completion time. We develop properties of optimal s...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملHeuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
This Article is brought to you for free and open access by the Engineering Management & Systems Engineering at ODU Digital Commons. It has been accepted for inclusion in Engineering Management & Systems Engineering Faculty Publications by an authorized administrator of ODU Digital Commons. For more information, please contact [email protected]. Repository Citation Salem, Mohammed Al; Bedoy...
متن کاملEfficient Heuristic Optimization in Single Machine Scheduling
In this paper, we present a comparison of heuristic optimization algorithms for single machine scheduling problems with and without arbitrary job release times. The main focus of our analysis is the efficiency of the examined methods, i.e. how they perform under strictly limited computation time. Furthermore, we study the effects of arbitrary release times on problem difficulty and required com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2009
ISSN: 1556-5068
DOI: 10.2139/ssrn.1472957